Simulating Strong Practical Proof Systems with Extended Resolution

Simulating Turing Machines through Extended Mh Systems

In this article we describe a method of translation from a deterministic Turing machine to an extended mH splicing system. The accuracy of this translation is proved by a theorem which shows that the only string present in single copy is a coding of a connguration of the simulated Turing machine. A simpler translation from a universal Turing machine with three tapes to an extended mH system is ...

Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract)

We exploit a system of realizers for classical logic, and a translation from resolution into the sequent calculus, to assess the in-tuitionistic force of classical resolution for a fragment of intuitionistic logic. This approach is in contrast to formulating locally intuitionistically sound resolution rules. The techniques use the-calculus, a development of Parigot's-calculus.

A Model-Based Completeness Proof of Extended Narrowing and Resolution

SIMULATING CONTINUOUS FUZZY SYSTEMS: I

In previous studies we first concentrated on utilizing crisp simulationto produce discrete event fuzzy systems simulations. Then we extendedthis research to the simulation of continuous fuzzy systems models. In this paperwe continue our study of continuous fuzzy systems using crisp continuoussimulation. Consider a crisp continuous system whose evolution depends ondifferential equations. Such a ...

QBF Resolution Systems and Their Proof Complexities

Quantified Boolean formula (QBF) evaluation has a broad range of applications in computer science and is gaining increasing attention. Recent progress has shown that for a certain family of formulas, Qresolution, which forms the foundation of learning in modern search-based QBF solvers, is exponentially inferior in proof size to two of its extensions: Q-resolution with resolution over universal...